Logical Relations for Fine - Grained Concurrency ( Expanded Technical Appendix )
نویسندگان
چکیده
منابع مشابه
Constructing a tractable reasoning framework upon a fine-grained structural operational semantics
The primary focus of this thesis is the semantic gap between a fine-grained structural operational semantics and a set of rely/guarantee-style development rules. The semantic gap is bridged by considering the development rules to be a part of the same logical framework as the operational semantics, and a set of soundness proofs show that the development rules, though making development easier f...
متن کاملThe Marriage of Bisimulations and Kripke Logical Relations Technical Appendix
1 Language 3 1.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Dynamic Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Static Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Contextual Equivalence . . . . . . . . . . . . . . ....
متن کاملEvaluation of Static and Dynamic Methods for Determining the Bearing Capacity of the Driven Pipe Piles (TECHNICAL NOTE)
Determination of the pile capacity is always a major concern for the safe geotechnical engineering design. Different direct and indirect methods have been proposed for determining pile bearing capacity such as static and dynamic approaches. Each method depends on the condition of the soil and type of pile as well as accessibility to necessary information. In this study bearing capacity of drive...
متن کاملTracing Logical Concurrency for Dynamic Race Detection in OpenMP Programs
OpenMP is an industry standard supporting a serialized program to be executed in parallel with simple compiler directives and libraries. OpenMP covers only user-directed parallelization and does not enforce to fix concurrency bugs, such as data races. However it is difficult to locate data races occurred in an execution of the program, because they may lead the program execution to be non-deter...
متن کاملModular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacerbate this problem, because threads interfere more often and in richer ways. In this paper we provide a thread-modular safety checker for a class of pointermanipulating fine-grained concurrent algorithms. Our checker u...
متن کامل